from gg import *

lMap = [[0,0,0],
	[0,0,0],
	[0,0,0]]
g = Graph()

for row in range(len(lMap)):
	for column in range(len(lMap[row])):
	    temp=(row,column)

	    #right neighbour
	    g.addEdge(temp,(temp[0]+1,temp[1]),1)

	    #left neighbour
	    g.addEdge(temp,(temp[0]-1,temp[1]),1)

	    #top neighbour
	    g.addEdge(temp,(temp[0],temp[1]+1),1)

	    #bottom neighbour
	    g.addEdge(temp,(temp[0],temp[1]-1),1)

	    #top-left neighbour
	    g.addEdge(temp,(temp[0]-1,temp[1]-1),1)

	    #top-right neighbour
	    g.addEdge(temp,(temp[0]+1,temp[1]-1),1)

	    #bottom-left neighbour
	    g.addEdge(temp,(temp[0]-1,temp[1]+1),1)

	    #bottom-right neighbour
	    g.addEdge(temp,(temp[0]+1,temp[1]+1),1)


##def minPath(start,end):
##    if end.getId() == start.getId():
##        return [start]
##    else:
##        return 

    
